Complexity Bounds for MCMC via Diffusion Limits
نویسندگان
چکیده
We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the Computer Science notion of algorithm complexity. Our main result states that any diffusion limit of a Markov process implies a corresponding complexity bound (in an appropriate metric). We then combine this result with previously-known MCMC diffusion limit results to prove that under appropriate assumptions, the Random-Walk Metropolis (RWM) algorithm in d dimensions takes O(d) iterations to converge to stationarity, while the Metropolis-Adjusted Langevin Algorithm (MALA) takes O(d) iterations to converge to stationarity.
منابع مشابه
Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits
We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the computer science notion of algorithm complexity. Ourmain result states that any weak limit of a Markov process implies a corresponding complexity bound (in an appropriate metric). We then combine this result with previously-known MCMC diffusion limit results to prove that under appropriate assum...
متن کاملMinimising Mcmc Variance via Diffusion Limits, with an Application to Simulated Tempering
We derive new results comparing the asymptotic variance of diffusions by writing them as appropriate limits of discrete-time birth–death chains which themselves satisfy Peskun orderings. We then apply our results to simulated tempering algorithms to establish which choice of inverse temperatures minimises the asymptotic variance of all functionals and thus leads to the most efficient MCMC algor...
متن کاملDiffusion Limits of the Random Walk Metropolis Algorithm in High Dimensions by Jonathan
Diffusion limits of MCMC methods in high dimensions provide a useful theoretical tool for studying computational complexity. In particular, they lead directly to precise estimates of the number of steps required to explore the target measure, in stationarity, as a function of the dimension of the state space. However, to date such results have mainly been proved for target measures with a produ...
متن کاملRigorous confidence bounds for MCMC under a geometric drift condition
interest and Ît,n = (1/n) ∑t+n−1 i=t f(Xi) its MCMC estimate. Precisely, we derive lower bounds for the length of the trajectory n and burn-in time t which ensure that P (|Ît,n − I| ≤ ε) ≥ 1− α. The bounds depend only and explicitly on drift parameters, on the V−norm of f, where V is the drift function and on precision and confidence parameters ε, α. Next we analyse an MCMC estimator based on t...
متن کاملDiffusion Limits of the Random Walk Metropolis Algorithm in High Dimensions
Diffusion limits of MCMC methods in high dimensions provide a useful theoretical tool for studying computational complexity. In particular, they lead directly to precise estimates of the number of steps required to explore the target measure, in stationarity, as a function of the dimension of the state space. However, to date such results have mainly been proved for target measures with a produ...
متن کامل